package com.lss.study.algorithm.niuke.T6;

import java.util.Scanner;

/**
 * 功能描述：
 *
 * @Date: 2022/2/19 18:21
 */
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        long num = scanner.nextLong();
        long k = (long) Math.sqrt(num);

        for (long i = 2; i <= k; ++i) {
            if (num < i) {
                break;
            }
            while (num % i == 0) {
                System.out.print(i + " ");
                num /= i;
            }
        }
//        System.out.println(num == 1 ? "": num+" ");
    }
}
